منابع مشابه
Bandwidth of Trees of Height at Most Two
For a graph G, let γ : V (G) → {1, 2, ..., |V (G)|} be a one-to-one function. The bandwidth of γ, is the maximum of |γ(u)−γ(v)| for uv ∈ E(G). The bandwidth of G, b(G), is the minimum bandwidth over all embeddings γ, b(G) = minγ{max{|γ(u)− γ(v)| : uv ∈ E(G)}}. In this paper, we show that the bandwidth computation problem for trees of height at most two can be solved in polynomial time. This nat...
متن کاملTrees with minimal index and diameter at most four
In this paper we consider the trees with fixed order n and diameter d ≤ 4. Among these trees we identify those trees whose index is minimal. © 2009 Elsevier B.V. All rights reserved.
متن کاملIntegral trees of diameter 4
An integral tree is a tree whose adjacency matrix has only integer eigenvalues. While most previous work by other authors has been focused either on the very restricted case of balanced trees or on finding trees with diameter as large as possible, we study integral trees of diameter 4. In particular, we characterize all diameter 4 integral trees of the form T (m1, t1) • T (m2, t2). In addition ...
متن کاملOn Unfolding Lattice Polygons/Trees and Diameter-4 Trees
We consider the problems of straightening polygonal trees and convexifying polygons by continuous motions such that rigid edges can rotate around vertex joints and no edge crossings are allowed. A tree can be straightened if all its edges can be aligned along a common straight line such that each edge points “away” from a designated leaf node. A polygon can be convexified if it can be reconfigu...
متن کامل4-PLACEMENT OF ROOTED TREES
A tree T of order n is called k-placement if there are k edge-disjoint copies of T into K_{n}. In this paper we prove some results about 4-placement of rooted trees.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2012
ISSN: 0012-365X
DOI: 10.1016/j.disc.2012.03.006